Limit on Connected Two Star Super Mean Graphs
نویسندگان
چکیده
منابع مشابه
On Super mean graphs
Let G be a (p, q) graph and let f : V (G) → {1, 2, 3, · · · , p + q} be an injection. For each edge e = uv, let f∗(e) = (f(u)+f(v))/2 if f(u)+f(v) is even and f∗(e) = (f(u)+f(v)+1)/2 if f(u) + f(v) is odd. Then f is called a super mean labeling if f(V ) ∪ {f∗(e) : e ∈ E(G)} = {1, 2, 3, · · · , p+ q}. A graph that admits a super mean labeling is called a super mean graph. In this paper we presen...
متن کاملSome Results on Super Mean Graphs
Let G be a graph and f : V (G) → {1, 2, 3, . . . , p+ q} be an injection. For each edge e = uv and an integer m ≥ 2, the induced Smarandachely edge m-labeling f∗ S is defined by f ∗ S(e) = ⌈ f(u) + f(v) m ⌉ . Then f is called a Smarandachely super m-mean labeling if f(V (G))∪ {f∗(e) : e ∈ E(G)} = {1, 2, 3, . . . , p+ q}. Particularly, in the case of m = 2, we know that f ∗(e) = f(u)+f(v) ...
متن کاملVulnerability of super edge-connected graphs
A subset F of edges in a connected graph G is a h-extra edge-cut if G − F is disconnected and every component has more than h vertices. The h-extra edge-connectivity λ(G) of G is defined as the minimum cardinality over all h-extra edge-cuts of G. A graph G, if λ(G) exists, is super-λ if every minimum h-extra edge-cut of G isolates at least one connected subgraph of order h + 1. The persistence ...
متن کاملmaximally edge - connected and super - edge - connected graphs ∗
Let G be a connected graph with minimum degree δ and edgeconnectivity λ. A graph is maximally edge-connected if λ = δ, and it is superedge-connected if every minimum edge-cut is trivial; that is, if every minimum edge-cut consists of edges incident with a vertex of minimum degree. In this paper, we show that a connected graph or a connected triangle-free graph is maximally edge-connected or sup...
متن کاملThe super connectivity of the pancake graphs and the super laceability of the star graphs
A k-container C(u, v) of a graph G is a set of k-disjoint paths joining u to v. A k-container C(u, v) of G is a k∗-container if it contains all the vertices of G. A graph G is k∗-connected if there exists a k∗-container between any two distinct vertices. Let (G) be the connectivity of G. A graph G is super connected if G is i∗-connected for all 1 i (G). A bipartite graph G is k∗-laceable if the...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computational Mathematica
سال: 2018
ISSN: 2456-8686
DOI: 10.26524/jcm33